Evaluation of the Waiting Time in a Finite Capacity Queue with Bursty Input and a Generalized Push-Out Strategy

In this paper, we study a finite capacity queue where the arrival process is special case of discrete time Markov modulated Poisson process, service times are generally distributed, and server takes repeated vacations when system empty. The buffer acceptance strategy based on generalized push-out scheme: full, an arriving customer pushes out Nth in queue, N values between 2 system, joins end queue. Such important when, as well short waiting for served customers, pushed-out occupies space also performance measure. Laplace transform determined. Numerical examples show influence bustiness input trade-off average customers occupancy customers.